package leetcode;

/**
 * @program: datastructureandalogorithm
 * @description:
 * @author: hmx
 * @create: 2022-02-24 18:26
 **/
public class LeetCode2177 {

    public long[] sumOfThree(long num) {
        long t = num - 3;
        if (t % 3 != 0) {
            return new long[0];
        }

        long min = t / 3;
        return new long[]{min, min + 1, min + 2};
    }

}
